Functional Test Generation using SAT-based Bounded Model Checking

نویسندگان

  • Heon-Mo Koo
  • Prabhat Mishra
چکیده

Functional validation is one of the major bottlenecks in processor design methodology due to combined effects of increasing complexity and decreasing time-to-market. Increasing complexity of designs leads to larger set of design errors. Shorter time-tomarket requires a faster validation scheme. Simulation using functional test vectors is the most widely used form of processor validation. While existing model checking based approaches have proposed several promising ideas for efficient test generation, many challenges remain in applying them to realistic pipelined processors. The time and resources required for test generation using existing model checking based techniques can be extremely large. This report presents an efficient test generation technique using SAT-based bounded model checking. To demonstrate the usefulness of this approach, we have applied this technique to generate test programs for validation of the VLIW MIPS processor.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pruning Techniques for the SAT-based Bounded Model Checking Problem

Bounded Model Checking (BMC) is the problem of checking if a model satisses a temporal property in paths with bounded length k. Propositional SAT-based BMC is conducted in a gradual manner, by solving a series of SAT instances corresponding to formulations of the problem with increasing k. We show how the gradual nature can be exploited for shortening the overall veriication time. The concept i...

متن کامل

Tuning SAT Checkers for Bounded Model Checking

Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counter example in executions whose length is bounded by some integer k. The BMC problem can be eeciently reduced to a propositional satissabil-ity problem, and can therefore be solved by SAT methods rather than BDDs. SAT p...

متن کامل

Boolean Satisfiability in Electronic Design Automation

Boolean Satisjiability (SAT) is often used as the underlying model for a signijicant and increasing number of applications in Electronic Design Automation (EDA) as well as in many other jields of Computer Science and Engineering. In recent years, new and efJicient algorithms for SAT have been developed, allowing much larger problem instances to be solved. SAT " packages " are currently expected...

متن کامل

Faster FDR Counterexample Generation Using SAT-Solving

With the flourishing development of efficient SAT-solvers, bounded model checking (BMC) has proven to be an extremely powerful symbolic model checking technique. In this paper, we address the problem of applying BMC to concurrent systems involving the interaction of multiple processes running in parallel. We adapt the BMC framework to the context of CSP and FDR yielding bounded refinement check...

متن کامل

Tuning SAT checkers for Bounded Model Checking

Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search for a counter example in executions whose length is bounded by some integer k. The BMC problem can be e ciently reduced to a propositional satis ability problem, and can therefore be solved by SAT methods rather than BDDs. SAT pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005